package leetcode;

import Tree.TreeNode;

public class FindModeInBST {

	public int[] findMode(TreeNode root) {

		return null;
	}
	
	public int help(TreeNode node, int val){
		if(node.left == null || node.right == null){
			return node.val == val ? 1 : 0;
		}
//		int left
		
		return 0;
	}
}
